Least-square approach for singular value decompositions of scattering problems

نویسندگان

چکیده

It was recently observed that chiral two-body interactions can be efficiently represented using matrix factorization techniques such as the singular value decomposition. However, exploitation of these low-rank structures in a few- or many-body framework is nontrivial and requires reformulations explicitly utilize decomposition format. In this work, we present general least-square approach applicable to different frameworks allows for an efficient reduction low number values iteration. We verify feasibility by solving Lippmann-Schwinger equation factorized form. The resulting approximations $T$ are found fully capture scattering observables. Potential applications other with goal employing tensor discussed.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wavelet Least Square Methods for Boundary Value Problems

This paper is concerned with least squares methods for the numerical solution of operator equations. Our primary focus is the discussion of the following conceptual issues: the selection of appropriate least squares functionals, their numerical evaluation in the special light of recent developments of multiscale and wavelet methods and a natural way of preconditioning the resulting systems of l...

متن کامل

Continuation of Singular Value Decompositions

In this work we consider computing a smooth path for a (block) singular value decomposition of a full rank matrix valued function. We give new theoretical results and then introduce and implement several algorithms to compute a smooth path. We illustrate performance of the algorithms with a few numerical examples.

متن کامل

collocation discrete least square (cdls) method for elasticity problems

a meshless approach, collocation discrete least square (cdls) method, is extended in this paper, for solvingelasticity problems. in the present cdls method, the problem domain is discretized by distributed field nodes. the fieldnodes are used to construct the trial functions. the moving least-squares interpolant is employed to construct the trialfunctions. some collocation points that are indep...

متن کامل

Eigenvalues and Singular Values 10.1 Eigenvalue and Singular Value Decompositions

This chapter is about eigenvalues and singular values of matrices. Computational algorithms and sensitivity to perturbations are both discussed. An eigenvalue and eigenvector of a square matrix A are a scalar λ and a nonzero vector x so that Ax = λx. A singular value and pair of singular vectors of a square or rectangular matrix A are a nonnegative scalar σ and two nonzero vectors u and v so th...

متن کامل

Numerical Methods for the Computation of Analytic Singular Value Decompositions

Abstract. An analytic singular value decomposition (ASVD) of a path of matrices E(t) is an analytic path of factorizations E(t) = X(t)S(t)Y (t) where X(t) and Y (t) are orthogonal and S(t) is diagonal. The diagonal entries of S(t) are allowed to be either positive or negative and to appear in any order. For an analytic path matrix E(t) an ASVD exists, but this ASVD is not unique. We present two...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review C

سال: 2022

ISSN: ['2470-0002', '2469-9985', '2469-9993']

DOI: https://doi.org/10.1103/physrevc.106.024320